Optimal algorithms for the online time series search problem
نویسندگان
چکیده
منابع مشابه
Optimal online algorithms for the multi-objective time series search problem
Abstract: Tiedemann, et al. [Proc. of WALCOM, LNCS 8973, 2015, pp.210-221] defined multiobjective online problems and the competitive analysis for multi-objective online problems and showed that (1) with respect to the worst component competitive analysis, the online algorithm reservation price policy rpp-high is best possible for the multi-objective time series search problem; (2) with respect...
متن کاملAlgorithms for Segmenting Time Series
As with most computer science problems, representation of the data is the key to ecient and eective solutions. Piecewise linear representation has been used for the representation of the data. This representation has been used by various researchers to support clustering, classication, indexing and association rule mining of time series data. A variety of algorithms have been proposed to obtain...
متن کاملOptimal Algorithms for Generalized Matrix Search Problem
We present a set of optimal and asymptotically optimal sequential and parallel algorith ms for the problem of searching on an m n sorted matrix m n Our two sequential algo rithms have a time complexity ofO m log n m which is shown to be optimal Our parallel algorithm runs in O log logm log logm log n m z time usingm log logm log logm processors on a COMMON CRCW PRAM where z is a monotonically d...
متن کاملOnline ARIMA Algorithms for Time Series Prediction
Autoregressive integrated moving average (ARIMA) is one of the most popular linear models for time series forecasting due to its nice statistical properties and great flexibility. However, its parameters are estimated in a batch manner and its noise terms are often assumed to be strictly bounded, which restricts its applications and makes it inefficient for handling large-scale real data. In th...
متن کاملthe algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2011
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2009.09.026